Circuit Morphing: Declarative Modeling of Reconfigurable Combinational Logic

نویسندگان

  • Paul Tarau
  • Brenda Luderman
چکیده

Using a simple reconfigurable logic gate that combines an ITE gate and a 1-bit memory cell we devise a mechanism for synthesizing fine grained circuits that overlap multiple logic functions. A declarative model of the approach, including an exact synthesizer for small circuits, is provided as a literate Haskell program (code available at http://logic.csci.unt.edu/tarau/research/2009/fsyn.hs). Potential applications include new processor architectures supporting fine grained massively parallel execution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell

We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact combinational logic circuit synthesizer is described as a combination of catamorphisms and anamorphisms. Using pairing and unpairing functions on natural number representations of truth tables, we derive an encoding for...

متن کامل

Implementing Multi-VRC Cores to Evolve Combinational Logic Circuits in Parallel

To conquer the scalability issue of evolvable hardware, this paper proposes a multi-virtual reconfigurable circuit (VRC) cores-based evolvable system to evolve combinational logic circuits in parallel. The basic idea behind the proposed scheme is to divide a combinational logic circuit into several subcircuits, and each of them is evolved independently as a subcomponent by its corresponding VRC...

متن کامل

Declarative Combinatorics: Exact Combinational Circuit Synthesis in a Logic Programming Framework

Logic Programming languages and combinational circuit synthesis tools share a common “combinatorial search over logic formulae” background. This paper attempts to reconnect the two fields with a fresh look at Prolog encodings for the combinatorial objects involved in circuit synthesis. While benefiting from Prolog’s fast unification algorithm and built-in backtracking mechanism, efficiency of o...

متن کامل

Evolutionary design of combinational logic circuits using VRA processor

This paper presents a virtual reconfigurable architecture (VRA)-based evolvable hardware for automatic synthesis of combinational logic circuits. The VRA processor is implemented on a Xilinx FPGA and works through two-stage evolutions: (1) finding a functional circuit, and (2) minimizing the number of gates used. To optimize the algorithm performance in the evolutionary process, a self-adaptive...

متن کامل

Using Genetic Algorithm in the Evolutionary Design of Sequential Logic Circuits

Evolvable hardware (EHW) is a set of techniques that are based on the idea of combining reconfiguration hardware systems with evolutionary algorithms. In other word, EHW has two sections; the reconfigurable hardware and evolutionary algorithm where the configurations are under the control of an evolutionary algorithm. This paper, suggests a method to design and optimize the synchronous sequenti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009